Towards fixed-parameter tractable algorithms for abstract argumentation
نویسندگان
چکیده
منابع مشابه
Towards fixed-parameter tractable algorithms for abstract argumentation
Article history: Received 16 June 2011 Received in revised form 1 February 2012 Accepted 11 March 2012 Available online 13 March 2012
متن کاملTowards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have been identified. In particular, Dunne showed that many problems can be solved in linear time for argumentation frameworks of bounded tree-width. However, these tractability results, which were obtained via Courcelle’s Th...
متن کاملFixed Parameter Tractable Algorithms in Combinatorial Topology
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in any 3-manifold triangulation, which leads to significant “wasted time” in top...
متن کاملAlmost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable? This problem is known to different research communities in theoretical computer science under the names Almost 2-SAT, All-but-k 2-SAT, 2-cnf deletion, and 2-SAT deletion. The status of the fixed-parameter tractability of this problem is a long-...
متن کاملA general method to speed up fixed-parameter-tractable algorithms
A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I, k) as its input and has to decide whether (I, k) ∈ L for some parameterized problem L. Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity is then of the form O(p(|I|) + q(k)ξ), where q(k) is the size of the problem kernel. We show ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2012
ISSN: 0004-3702
DOI: 10.1016/j.artint.2012.03.005